EXPERIMENTS PROCESSES COUNTER-NARRATIVES

Modding the Humanities: Experiments in Historic Narratives

Modeling Complex Historical Processes with Analytic Narratives

The analytic narratives project represents an effort to clarify and make explicit the approach adopted by numerous scholars trying to combine historical and comparative research with rational choice models. In order to understand instances of institutional origin and change, analytic narrativists insist on the combination of deep knowledge of the case and an explicit theoretical model. These re...

Efficient Verification Algorithms for One-Counter Processes

We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between processes of one-counter nets (which are ‘weak’ one-counter automata) and finite-state processes is DP-hard (in particular, it means that the problem is both NP and co-NP hard). The same technique is used to demonstrate co-N...

Decidability of Bisimilarity for One-Counter Processes

It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterministic) pushdown automata where the pushdown behaves like a counter. Also niteness up to bisimilarity is shown to be decidable for the mentioned processes. 1 1 This paper is to appear in Information and Computation. The nal revisions were carried out while the author visited Uppsala university due t...

Simulation and Bisimulation over One-Counter Processes

We show an effective construction of (a periodicity description of) the maximal simulation relation for a given one-counter net. Then we demonstrate how to reduce simulation problems over one-counter nets to analogous bisimulation problems over one-counter automata. We use this to demonstrate the decidability of various problems, specifically testing regularity and strong regularity of one-coun...